منابع مشابه
Clausal Tableaux for Hybrid PDL
PDL (propositional dynamic logic) [6, 11, 8] is an expressive modal logic invented for reasoning about programs. It extends basic modal logic with expressions called programs. Programs describe relations from states to states and are used to express modalities. Programs are composed with the operators familiar from regular expressions. In addition, they may employ formulas so that conditionals ...
متن کاملClausal Graph Tableaux for Hybrid Logic with Eventualities and Difference
We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. They provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no ...
متن کاملExpTime Tableaux with Global Caching for Hybrid PDL
We present the first direct tableau decision procedure with the ExpTime complexity for HPDL (Hybrid Propositional Dynamic Logic). It checks whether a given ABox (a finite set of assertions) in HPDL is satisfiable. Technically, it combines global caching with checking fulfillment of eventualities and dealing with nominals. Our procedure contains enough details for direct implementation and has b...
متن کاملRedundancy for rigid clausal tableaux
Redundancy is a substantial concept when avoiding endless computation in theorem proving methods. In this paper, we are targeting a special class of tableau calculi, namely rigid clausal tableaux. These tableaux are (1) clausal in the sense that they consist solely of literals, and are (2) rigid in the sense that they employ rigid variables. Such calculi are e.g. rigid hyper tableaux [7] and mu...
متن کاملClausal Tableaux for Multimodal Logics of Belief
We develop clausal tableau calculi for seven multimodal logics variously designed for reasoning about multi-degree belief, reasoning about distributed systems of belief and for reasoning about epistemic states of agents in multi-agent systems. Our tableau calculi are sound, complete, cut-free and have the analytic superformula property, thereby giving decision procedures for all of these logics...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2011
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2011.10.009